Technical history of discrete logarithms in small characteristic finite fields
نویسندگان
چکیده
منابع مشابه
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
Since 2013 there have been several developments in algorithms for computing discrete logarithms in small-characteristic finite fields, culminating in a quasipolynomial algorithm. In this paper, we report on our successful computation of discrete logarithms in the cryptographically-interesting characteristic-three finite field F36·509 using these new algorithms; prior to 2013, it was believed th...
متن کاملIndiscreet logarithms in finite fields of small characteristic
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known algorithms being of subexponential complexity. In this expository article we describe the key insights and constructions which culminated in two independent q...
متن کاملDiscrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances (Invited Talk)
The discrete logarithm problem is one of the few hard problems on which public-key cryptography can be based. It was introduced in the field by the famous Diffie–Hellman key exchange protocol. Initially, the cryptographic use of the problem was considered in prime fields, but was readily generalized to arbitrary finite fields and, later, to elliptic or higher genus curves. In this talk, we surv...
متن کاملA simplified setting for discrete logarithms in small characteristic finite fields
We present an algorithm for constructing genus 2 curves over a finite field with a given number of points on its Jacobian. This has important applications in cryptography, where groups of prime order are used as the basis for discrete-log based cryptosystems. For a quartic CM field K with primitive CM type, we compute the Igusa class polynomials modulo p for certain small primes p and then use ...
متن کاملDiscrete logarithms over finite fields
Discrete exponentiation in a finite field is a direct analog of ordinary exponentiation. The exponent can only be an integer, say n, but for w in a field F , w is defined except when w = 0 and n ≤ 0, and satisfies the usual properties, in particular w = ww and (for u and v in F ) (uv) = uv. The discrete logarithm is the inverse function, in analogy with the ordinary logarithm for real numbers. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2015
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-015-0147-6